Linear coloring of sparse graphs
نویسندگان
چکیده
منابع مشابه
On Coloring of Sparse Graphs
Graph coloring has numerous applications and is a wellknown NP-complete problem. The goal of this paper is to survey recent results of the authors on coloring and improper coloring of sparse graphs and to point out some polynomial-time algorithms for coloring (not necessarily optimal) of graphs with bounded maximum average degree. Mathematics Subject Classification: 05C15, 05C35
متن کاملStar coloring of sparse graphs
A proper coloring of the vertices of a graph is called a star coloring if the union of every two color classes induce a star forest. The star chromatic number χs(G) is the smallest number of colors required to obtain a star coloring of G. In this paper, we study the relationship between the star chromatic number χs(G) and the maximum average degree Mad(G) of a graph G. We prove that: 1. If G is...
متن کاملColoring Graphs with Sparse Neighborhoods
It is shown that the chromatic number of any graph with maximum degree d in which the number of edges in the induced subgraph on the set of all neighbors of any vertex does not exceed d/f is at most O(d/ log f). This is tight (up to a constant factor) for all admissible values of d and f .
متن کاملLinear Coloring and Linear Graphs
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology [9], and the framework through which it was studied, we introduce the linear coloring on graphs. We provide an upper bound for the chromatic number χ(G), for any graph G, and show that G can be linearly colored in polynomial time by proposing a simple linear coloring ...
متن کاملLimits of Near-Coloring of Sparse Graphs
Let a, b, d be non-negative integers. A graph G is (d, a, b)-colorable if its vertex set can be partitioned into a + b sets D1, . . . , Da, O1, . . . , Ob such that the graph G[Di] induced by Di has maximum degree at most d for 1 ≤ i ≤ a, while the graph G[Oj ] induced by Oj is an edgeless graph for 1 ≤ j ≤ b. In this paper, we give two real-valued functions f and g such that any graph with max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.028